n-Parties Contract Based Transportation Problem and Its Solution
نویسندگان
چکیده
منابع مشابه
An Event-Based Solution to the Perspective-n-Point Problem
The goal of the Perspective-n-Point problem (PnP) is to find the relative pose between an object and a camera from a set of n pairings between 3D points and their corresponding 2D projections on the focal plane. Current state of the art solutions, designed to operate on images, rely on computationally expensive minimization techniques. For the first time, this work introduces an event-based PnP...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملFuzzy Optimal Solution to Fuzzy Transportation Problem: A New Approach
In this paper we propose a new algorithm for the initial fuzzy feasible solution to a fully fuzzy transportation problem. Then by using fuzzy version of modified distribution method, we obtain the fuzzy optimal solution for the fully fuzzy transportation problem without converting to a classical transportation problem. A numerical example is provided to illustrate the proposed algorithm. It can...
متن کاملA Collusion Problem and Its Solution
Consider a group of colluders each with certain knowledge such as identity of some other colluders, some cryptographic keys, and some data, possibly multiply encrypted. Two colluders can combine their knowledge if their current knowledge satis es certain condition. Their cryptographic keys can help decrypt each other's encrypted data, expanding their knowledge and revealing more collusion oppor...
متن کاملThe Temporal Knapsack Problem and Its Solution
This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Research and Applications
سال: 2017
ISSN: 2248-9622,2248-9622
DOI: 10.9790/9622-0706023346